翻訳と辞書 Words near each other ・ Unrestricted domain ・ Unrestricted grammar ・ Unrestricted Hartree–Fock ・ Unrestricted Line Officer ・ Unrestricted submarine warfare ・ Unrestricted Warfare ・ UNRIC ・ Unriddle ・ Unriddle 2 ・ Unriddle episodes ・ Unring the bell ・ Unrivaled ・ Unrivaled Belle ・ Unrockbar ・ Unrolled linked list ・ Unrooted binary tree ・ Unrooted Childhoods ・ Unrotated projectile ・ UNROW Human Rights Impact Litigation Clinic ・ Unruh ・ Unruh Civil Rights Act ・ Unruh effect ・ Unruhe ・ Unruled Paper (film) ・ Unruly aircraft passenger ・ Unruly Child ・ Unruly Qiao ・ Unruoch II of Friuli ・ Unruoch III of Friuli ・ Unruochings Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Unrooted binary tree ： ウィキペディア英語版 Unrooted binary tree In mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors. ==Definitions== A free tree or unrooted tree is a connected undirected graph with no cycles. The vertices with one neighbor are the ''leaves'' of the tree, and the remaining vertices are the ''internal nodes'' of the tree. The degree of a vertex is its number of neighbors; in a tree with more than one node, the leaves are the vertices of degree one. An unrooted binary tree is a free tree in which all internal nodes have degree exactly three. In some applications it may make sense to distinguish subtypes of unrooted binary trees: a planar embedding of the tree may be fixed by specifying a cyclic ordering for the edges at each vertex, making it into a plane tree. In computer science, binary trees are often rooted and ordered when they are used as data structures, but in the applications of unrooted binary trees in hierarchical clustering and evolutionary tree reconstruction, unordered trees are more common.〔 Additionally, one may distinguish between trees in which all vertices have distinct labels, trees in which the leaves only are labeled, and trees in which the nodes are not labeled. In an unrooted binary tree with ''n'' leaves, there will be ''n'' − 2 internal nodes, so the labels may be taken from the set of integers from 1 to 2''n'' − 1 when all nodes are to be labeled, or from the set of integers from 1 to ''n'' when only the leaves are to be labeled.〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Unrooted binary tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.